Separability by two lines and by flat polygonals∗

نویسندگان

  • Ferran Hurtado
  • Mercè Mora
  • Pedro A. Ramos
  • Carlos Seara
چکیده

In this paper we study the separability in the plane by two criteria: double wedge separability and constant turn separability. We give O(N logN)-time optimal algorithms for computing all the separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and the flattest minimal constant turn polygonal line separating two sets of points.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intrinsic Characterizations of Orthogonal Separability for Natural Hamiltonians with Scalar Potentials on Pseudo-Riemannian Spaces

Orthogonal separability of finite-dimensional Hamiltonians is characterized by using various geometrical concepts, including Killing tensors, moving frames, the Nijenhuis tensor, bi-Hamiltonian and quasi-bi-Hamiltonian representations. In addition, a complete classification of separable metrics defined in two-dimensional locally flat Lorenzian spaces is presented.

متن کامل

Evaluation of Tests for Separability and Symmetry of Spatio-temporal Covariance Function

In recent years, some investigations have been carried out to examine the assumptions like stationarity, symmetry and separability of spatio-temporal covariance function which would considerably simplify fitting a valid covariance model to the data by parametric and nonparametric methods. In this article, assuming a Gaussian random field, we consider the likelihood ratio separability test, a va...

متن کامل

Separability by two lines and by nearly straight polygonal chains

In this paper we study the separability in the plane by two criteria: double-wedge separability and Θ-separability. We give an O(N logN)-time optimal algorithm for computing all the vertices of separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and an O((N/Θ0) logN)-time algorithm for computing a nearly-straight minimal Θ-polygonal chain separating...

متن کامل

Circle of Willis in adults.

OBJECTIVE This study was carried out to describe the main variations of the Circle of Willis and to clarify the clinical importance of these variations, so that practitioners and the students are more alert when dealing with this subject. METHODS This work is based on the study of 50 Circles of Willis from adult Jordanians who died from diverse causes without signs of cerebrovascular diseases...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002